GPU parallelization strategies for metaheuristics: a survey
نویسندگان
چکیده
منابع مشابه
Parallelization Strategies for Hybrid Metaheuristics Using a Single GPU and Multi-core Resources
Hybrid metaheuristics are powerful methods for solving complex problems in science and industry. Nevertheless, the resolution time remains prohibitive when dealing with large problem instances. As a result, the use of GPU computing has been recognized as a major way to speed up the search process. However, most GPU-accelerated algorithms of the literature do not take benefits of all the availab...
متن کاملTowards ParadisEO-MO-GPU: A Framework for GPU-Based Local Search Metaheuristics
This paper is a major step towards a pioneering software framework for the reusable design and implementation of parallel metaheuristics on Graphics Processing Units (GPU). The objective is to revisit the ParadisEO framework to allow its utilization on GPU accelerators. The focus is on local search metaheuristics and the parallel exploration of their neighborhood. The challenge is to make the G...
متن کاملCandidate Set Parallelization Strategies for Ant Colony Optimization on the GPU
For solving large instances of the Travelling Salesman Problem (TSP), the use of a candidate set (or candidate list) is essential to limit the search space and reduce the overall execution time when using heuristic search methods such as Ant Colony Optimisation (ACO). Recent contributions have implemented ACO in parallel on the Graphics Processing Unit (GPU) using NVIDIA CUDA but struggle to ma...
متن کاملParallelization Strategies for a Molecular Dynamics Program
A molecular-dynamics program typically takes several man-years to write and therefore is representative for a large class of scientiic programs whose rewriting should not be taken lightly. This paper discusses two Intel hypercube adaptations, UHGROMOS and Euler-GROMOS (in progress), of a \dusty-deck" molecular-dynamics code, GROMOS. UHGROMOS uses a low-impact parallelization strategy to minimiz...
متن کاملResearch Report: GPU-based Approaches for Hybrid Metaheuristics
In combinatorial optimization, near-optimal algorithms such as metaheuristics allow to iteratively solve in a reasonable time NP-hard complex problems. Two main categories of metaheuristics are distinguished: population-based metaheuristics (P-metaheuristics) and solution-based metaheuristics (S-metaheuristics). P-metaheuristics are population-oriented as they manage a whole population of solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Parallel, Emergent and Distributed Systems
سال: 2018
ISSN: 1744-5760,1744-5779
DOI: 10.1080/17445760.2018.1428969